Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks

Extra edge connectivity of hypercube-like networks

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...

Edge-fault tolerance of hypercube-like networks

Hamiltonian Connectivity of Twisted Hypercube-Like Networks under the Large Fault Model

Twisted hypercube-like networks (THLNs) are an important class of interconnection networks for parallel computing systems, which include most popular variants of the hypercubes, such as crossed cubes, Möbius cubes, twisted cubes and locally twisted cubes. This paper deals with the fault-tolerant hamiltonian connectivity of THLNs under the large fault model. Let G be an n-dimensional THLN and F ...

Restricted Fault Diameter of Hypercube Networks

This paper studies restricted fault diameter of the n-dimensional hypercube networks Qn (n ≥ 2). It is shown that for arbitrary two vertices x and y with the distance d in Qn and any set F with at most 2n− 3 vertices in Qn −{x, y}, if F contains neither of neighbor-sets of x and y in Qn, then the distance between x and y in Qn − F is given by D(Qn − F ;x, y)   = 1, for d = 1; ≤ d + 4, for ...

The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks

The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...